Constraints Based Grammar Formalism for Japanese
نویسنده
چکیده
The Japanese language has rather simple morphology and semanticsoriented syntax. It is also heavily context dependent in the sense that many constituents can be omitted. Thus we need to formalize Japanese grammar to take morphology, syntax, semantics and pragmatic factors into account. Based on CUProlog which is a constraint logic programming language, we have developed a grammar formalism for Japanese. In this paper, we show its outline and some running examples.
منابع مشابه
The Treatment of Japanese Focus Particles Based on Lexical-Functional Grammar
The purpose of this paper is to discuss treatment of 'focus particles' in Japanese sentences to be incorporated in a Japanese parsing system based on the Lexical-Functional Grammar(LFG) formalism. Focus particle can follow nouns, quantifiers, verbs, other particles (postpositions) and auxiliary verbs. Thus, it is necessary for a large-scale grammar to treat focus particles properly. Furthermore...
متن کاملJapanese Parser on the basis of the Lexical-Functional Grammar Formalism and its Evaluation
We report a Japanese parsing system with a linguistically fine-grained grammar based on the Lexical-Functional Grammar (LFG) formalism. The system is the first Japanese LFG parser with over 97% coverage for real-world text. We evaluated the accuracy of the system comparing it with standard Japanese dependency parsers. The LFG parser shows roughly equivalent performance on the dependency accurac...
متن کاملSyntactic Constraints On Relativization In Japanese
1 Int roduct ion This paper discusses the formalization of relative clauses in Japanese based on JPSG (Japanese Phrase Structure Grammar)[I, 2], which is a constraintbased grammar formalism like tlPSG(Head-driven Phrase Structure Grammar)[7, 8]. We have worked on JPSG with Prof. Gunji, and also have developed a parser based on an efficient mechanism for dealing with constraints[3, 4, 10] to sho...
متن کاملA Learnable Constraint-based Grammar Formalism
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable learnability results. The learnability result for LWFGs assumes that the semantic composition constraints are learnable. In this paper, we show what are the properties and principles the semantic representation and gramm...
متن کاملPAC Learning Constraint Dependency Grammar Constraints
Constraint Dependency Grammar (CDG) 11, 13] is a constraint-based grammatical formalism that has proven eeective for processing English 5] and improving the accuracy of spoken language understanding systems 4]. However, prospective users of CDG face a steep learning curve when trying to master this powerful formalism. Therefore, a recent trend in CDG research has been to try to ease the burden ...
متن کامل